منابع مشابه
A cryptanalytic time-memory trade-off
A&M&-A probabilistic method is presented wtdcb cryptanalyzes any N key cryptosystem in N2i3 operations with N2j3 words of memory (average vale) after a precomputatioo which requires N operations. If tke precomputation cao be performed in a reasooable time period (e.g* several years), the additional computation reqoired to recover e& key compares very favorably wltb the N operations reqdred by a...
متن کاملMaking a Faster Cryptanalytic Time-Memory Trade-Off
In 1980 Martin Hellman described a cryptanalytic time-memory trade-off which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points which drastically reduces the number of memory lookups during cryptanalysis. This improved technique has been studied extensively but no new opt...
متن کاملA New Cryptanalytic Time/Memory/Data Trade-off Algorithm
In 1980, Hellman introduced a time/memory trade-off (TMTO) algorithm satisfying the TMTO curve TM = N, where T is the online time, M is the memory and N is the size of the search space. Later work by Biryukov-Shamir incorporated multiple data to obtain the curve TMD = N, where D is the number of data points. In this paper, we describe a new table structure obtained by combining Hellman’s struct...
متن کاملA novel time-memory trade-off method for password recovery
As users become increasingly aware of the need to adopt strong password, it hinders the digital forensics investigations due to the password protection of potential evidence data. In this paper, we analyse and discuss existing password recovery methods, and identify the need for a more efficient and effective method to aid the digital forensics investigation process. We show that our new time-m...
متن کاملTime-Memory Trade-Off for Lattice Enumeration in a Ball
Enumeration algorithms in lattices are a well-known technique for solving the Short Vector Problem (SVP) and improving blockwise lattice reduction algorithms. Here, we propose a new algorithm for enumerating lattice point in a ball of radius 1.156λ1(Λ) in time 3n+o(n), where λ1(Λ) is the length of the shortest vector in the lattice Λ. Then, we show how this method can be used for solving SVP an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1980
ISSN: 0018-9448
DOI: 10.1109/tit.1980.1056220